A pr 2 00 1 The Structure of the Inverse to the Sylvester Resultant Matrix
نویسنده
چکیده
Abstract Given polynomials a(λ) of degree m and b(λ) of degree n, we represent the inverse to the Sylvester resultant matrix of a and b, if this inverse exists, as a canonical sum of m + n dyadic matrices each of which is a rational function of zeros of a and b. As a result, we obtain the polynomial solutions x(λ) of degree n − 1 and y(λ) of degree m − 1 to the equation a(λ)x(λ) + b(λ)y(λ) = c(λ), where c(λ) is a given polynomial of degree m + n− 1, as follows: x(λ) is the Lagrange interpolation polynomial for the function c(λ)/a(λ) over the set of zeros of b(λ) and y(λ) is the one for the function c(λ)/b(λ) over the set of zeros of a(λ) .
منابع مشابه
On the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001